101. Symmetric Tree - LeetCode Solution


Tree DFS BFS

Python Code:

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def isSymmetric(self, root: Optional[TreeNode]) -> bool:
        q = [root, None]
        s = []
        count = 0
        
        while len(q) != 0:
            k = q.pop(0)
            
            if k == None:
                count +=1
                if s != s[::-1]:
                    return False

                s = []
                q.append(None)
                if count >1:
                    break
                continue
            count = 0
            if k == 101:
                s.append(101)
                continue
            if k.right:
                q.append(k.right)
            else:
                q.append(101)
            if k.left:
                q.append(k.left)
            else:
                q.append(101)
            
            s.append(k.val)
        return True


Comments

Submit
0 Comments
More Questions

320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet
981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits
1476E - Pattern Matching
1107A - Digits Sequence Dividing
1348A - Phoenix and Balance
1343B - Balanced Array
1186A - Vus the Cossack and a Contest
1494A - ABC String
1606A - AB Balance
1658C - Shinju and the Lost Permutation
1547C - Pair Programming
550A - Two Substrings
797B - Odd sum
1093A - Dice Rolling
1360B - Honest Coach
1399C - Boats Competition
1609C - Complex Market Analysis
1657E - Star MST